Multiplier - based Binary - to - RNS Converter Modulo

نویسندگان

  • Pedro Miguens Matutino
  • Hector Pettenghi
  • Ricardo Chaves
چکیده

In this paper a new ROM-less structure for binaryto-RNS conversion modulo {2 ± k} is proposed. The proposed structure is based on adders and constant multipliers units without the need for ROMs. The development of this generic structure is motivated by the inefficient performance and area occupation of structures that are generated for larger Dynamic Ranges, from the existing ROM based conversion structures for modulo {2 ± k}. Experimental results obtained for an ASIC technology suggest that the proposed conversion structures are on average 6 times faster and require 91% less area resources when compared with the residue converters topologies know to date.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design Of Modulo − Multipliers Using DR-RNS Based On Radix-8 Booth Encoded Algorithm

Modular arithmetic operations l ike inversion, multiplication and exponentiation are used in several cryptography applications. A special modulo set of forms {21,2,2+1}are preferred over the generic modulo due to the ease of hardware implementation of modulo arithmetic functions as well as systemlevel intermodulo operations, such as RNS-to-binary conversion and sign detections. Key sizes in the...

متن کامل

Low-Power Radix-8 Booth Encoded Modulo 2n − 1 Multiplier with Adaptive Delay

A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very-large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area an...

متن کامل

Parallel Prefix Adder for High Dynamic Range Residue Number System

A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2 − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area and...

متن کامل

Study of the Reverse Converters for the Large Dynamic Range Four-Moduli Sets

The Residue Number System (RNS) is an efficient alternative number system which has been attracted researchers for over three decades. In RNS, arithmetic operations such as addition and multiplication can be performed on residues without carry-propagation between them; resulting in parallel arithmetic and high-speed hardware implementations (Parhami, 2000; Mohan, 2002; Omondi & Premkumar, 2007)...

متن کامل

Modulo Multiplier by using Radix-8 Modified Booth Algorithm

Modular arithmetic operations (inversion, multiplication and exponentiation) are used in several cryptography applications. RSA and elliptic curve cryptography (ECC) are two of the most well established and widely used public key cryptographic (PKC) algorithms. The encryption and decryption of these PKC algorithms are performed by repeated modulo multiplications. These multiplications differ fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012